An Approach Using Lagrangian/surrogate Relaxation for Lot-sizing with Transportation Costs
نویسندگان
چکیده
The aim of this work was to study a distribution and lot-sizing problem that considers costs with transportation to a company warehouse as well as, inventory, production and setup costs. The logistic costs are associated with necessary containers to pack produced items. The company negotiates a long-term contract in which a fixed cost per period is associated with the transportation of the items. On the other hand, a limited number of containers are available with a lower cost than the average cost. If an occasional demand increase occurs, other containers can be utilized; however, their costs are higher. A mathematical model was proposed in the literature and solved using the Lagrangian heuristic. Here, the use of the Lagrangian/ surrogate heuristic to solve the problem is evaluated. Moreover, an extension of the literature model is considered adding capacity constraints and allowing backlogging. Computational tests show that Lagrangian/ surrogate heuristics are competitive, especially when the capacity constraints are tight.
منابع مشابه
Coordinated Capacitated Lot-Sizing Problem with Dynamic Demand: A Lagrangian Heuristic
Coordinated replenishment problems are common in manufacturing and distribution when a family of items shares a common production line, supplier, or a mode of transportation. In these situations the coordination of shared, and often limited, resources across items is economically attractive. This paper describes a mixed-integer programming formulation and Lagrangian relaxation solution procedur...
متن کاملModeling and Analyzing Incremental Quantity Discounts in Transportation Costs for a Joint Economic Lot Sizing Problem
Joint economic lot sizing (JELS) addresses integrated inventory models in a supply chain. Most of the studies in this field either do not consider the role of the transportation cost in their analysis or consider transportation cost as a fixed part of the ordering costs. In this article, a model is developed to analyze an incremental quantity discount in transportation cost. Appropriate equatio...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کاملThe multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
We address a multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is np-hard. We propose a Lagrangian relaxation of the resource capacity constraints. We develop a dynamic programming algor...
متن کاملA Lagrangian Relaxation Approach for Supply Chain Planning with Order/setup Costs and Capacity Constraints
A heuristic approach is developed for supply chain planning modeled as multi-item multi-level capacitated lot sizing problems. The heuristic combines Lagrangian relaxation (LR) with local search. Different from existing LR approaches that relax capacity constraints and/or inventory balance constraints, our approach only relaxes the technical constraints that each 0-1 setup variable must take va...
متن کامل